Load Balancing for Parallel Motif Discoveries
نویسندگان
چکیده
منابع مشابه
Load Balancing for Parallel Motif Discoveries
The problem of motif discovery has been studied extensively over the last few decades. Many sequential and parallel algorithms have been proposed and studied. A significant runtime is still required for several challenging instances of the motif search problem. This paper studies parameter spaces to find an optimal point for load balancing between the master and the worker processes, which are ...
متن کاملDynamic Load Balancing for Parallel
Adaptive mesh reenement is a key problem in large-scale numerical calculations. The need of adaptive mesh reenement could introduce load imbalance among processors, where the load measures the amount of work required by reenement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication...
متن کاملParallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds Θ(logn/ log logn) balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one by one, into the least full bin from its d choices [2]. They show that after all n balls have been placed,...
متن کاملLoad Balancing Strategies for Parallel SAMR Algorithms
Highly resolved solutions of partial differential equations are important in many areas of science and technology nowadays. Only adaptive mesh refinement methods reduce the necessary work sufficiently allowing the calculation of realistic problems. Blockstructured SAMR methods are well-suited for the time-explicit computation of large-scale dynamical problems, but still require parallelization ...
متن کاملLoad Balancing for Parallel Optimization Techniques
Discrete optimization problems are solved using a variety of state space search techniques. The choice of technique is influenced by a variety of factors such as availability of heuristics and bounds, structure of state space, underlying machine architecture, availability of memory, and optimality of desired solution. The computational requirements of these techniques necessitates the use of la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015905745